Search results for "Tridiagonal matrix"

showing 7 items of 7 documents

Numerical experiments with a parallel fast direct elliptic solver on Cray T3E

1997

A parallel fast direct O(N log N) solver is shortly described for linear systems with separable block tridiagonal matrices. A good parallel scalability of the proposed method is demonstrated on a Cray T3E parallel computer using MPI in communication. Also, the sequential performance is compared with the well-known BLKTRI-implementation of the generalized. cyclic reduction method using a single processor of Cray T3E.

ComputerSystemsOrganization_COMPUTERSYSTEMIMPLEMENTATIONTridiagonal matrixComputer scienceLinear systemMathematicsofComputing_NUMERICALANALYSISParallel algorithmParallel computingComputerSystemsOrganization_PROCESSORARCHITECTURESSolverMatrix (mathematics)ScalabilityPoisson's equationTime complexityCyclic reductionBlock (data storage)
researchProduct

Robust and Efficient IMEX Schemes for Option Pricing under Jump-Diffusion Models

2013

We propose families of IMEX time discretization schemes for the partial integro-differential equation derived for the pricing of options under a jump diffusion process. The schemes include the families of IMEX-midpoint, IMEXCNAB and IMEX-BDF2 schemes. Each family is defined by a convex parameter c ∈ [0, 1], which divides the zeroth-order term due to the jumps between the implicit and explicit part in the time discretization. These IMEX schemes lead to tridiagonal systems, which can be solved extremely efficiently. The schemes are studied through Fourier stability analysis and numerical experiments. It is found that, under suitable assumptions and time step restrictions, the IMEX-midpoint fa…

Mathematical optimizationTridiagonal matrixDiscretizationJump diffusionRegular polygonComputer Science::Numerical AnalysisStability (probability)Mathematics::Numerical Analysissymbols.namesakeFourier transformValuation of optionssymbolsMathematicsLinear multistep methodSSRN Electronic Journal
researchProduct

Tridiagonal preconditioning for Poisson-like difference equations with flat grids: Application to incompressible atmospheric flow

2011

AbstractThe convergence of many iterative procedures, in particular that of the conjugate gradient method, strongly depends on the condition number of the linear system to be solved. In cases with a large condition number, therefore, preconditioning is often used to transform the system into an equivalent one, with a smaller condition number and therefore faster convergence. For Poisson-like difference equations with flat grids, the vertical part of the difference operator is dominant and tridiagonal and can be used for preconditioning. Such a procedure has been applied to incompressible atmospheric flows to preserve incompressibility, where a system of Poisson-like difference equations is …

Poisson-like equationBiconjugate gradient method010504 meteorology & atmospheric sciencesTridiagonal matrixOperator (physics)Applied MathematicsLinear systemGeometryPreconditioning010103 numerical & computational mathematics01 natural sciencesComputational MathematicsConjugate gradient methodConvergence (routing)Convergence accelerationApplied mathematicsDynamic pressure0101 mathematicsCondition numberCondition numberAtmospheric model0105 earth and related environmental sciencesMathematicsFlat gridsJournal of Computational and Applied Mathematics
researchProduct

Qualitative analysis of matrix splitting methods

2001

Abstract Qualitative properties of matrix splitting methods for linear systems with tridiagonal and block tridiagonal Stieltjes-Toeplitz matrices are studied. Two particular splittings, the so-called symmetric tridiagonal splittings and the bidiagonal splittings, are considered, and conditions for qualitative properties like nonnegativity and shape preservation are shown for them. Special attention is paid to their close relation to the well-known splitting techniques like regular and weak regular splitting methods. Extensions to block tridiagonal matrices are given, and their relation to algebraic representations of domain decomposition methods is discussed. The paper is concluded with ill…

Pure mathematicsSOR methodTridiagonal matrixLinear systemBlock (permutation group theory)Tridiagonal matrix algorithmDomain decomposition methodsComputer Science::Numerical AnalysisStieltjes-Toeplitz matricesMathematics::Numerical AnalysisAlgebraComputational MathematicsQualitative analysisComputational Theory and MathematicsMatrix splittingModeling and SimulationModelling and SimulationMatrix splitting methodsRegular and weak regular splittingsDomain decompositionAlgebraic numberQualitative analysisMathematicsComputers & Mathematics with Applications
researchProduct

Tridiagonality, supersymmetry and non self-adjoint Hamiltonians

2019

In this paper we consider some aspects of tridiagonal, non self-adjoint, Hamiltonians and of their supersymmetric counterparts. In particular, the problem of factorization is discussed, and it is shown how the analysis of the eigenstates of these Hamiltonians produce interesting recursion formulas giving rise to biorthogonal families of vectors. Some examples are proposed, and a connection with bi-squeezed states is analyzed.

Statistics and ProbabilityFOS: Physical sciencesGeneral Physics and Astronomy01 natural sciencesFactorization0103 physical sciences010306 general physicsSettore MAT/07 - Fisica MatematicaMathematical PhysicsEigenvalues and eigenvectorsMathematicsQuantum PhysicsTridiagonal matrix010308 nuclear & particles physicsRecursion (computer science)Statistical and Nonlinear Physicstridiagonal matriceMathematical Physics (math-ph)SupersymmetryConnection (mathematics)non self-adjoint HamiltonianAlgebrabiorthogonal basesModeling and SimulationBiorthogonal systemQuantum Physics (quant-ph)Self-adjoint operatorJournal of Physics A: Mathematical and Theoretical
researchProduct

Fast Poisson solvers for graphics processing units

2013

Two block cyclic reduction linear system solvers are considered and implemented using the OpenCL framework. The topics of interest include a simplified scalar cyclic reduction tridiagonal system solver and the impact of increasing the radix-number of the algorithm. Both implementations are tested for the Poisson problem in two and three dimensions, using a Nvidia GTX 580 series GPU and double precision floating-point arithmetic. The numerical results indicate up to 6-fold speed increase in the case of the two-dimensional problems and up to 3- fold speed increase in the case of the three-dimensional problems when compared to equivalent CPU implementations run on a Intel Core i7 quad-core CPU…

Tridiagonal matrixOpenCLComputer scienceparallel computingScalar (mathematics)Linear systemSyklinen reductionGPGPUGPUDouble-precision floating-point formatParallel computingSolverPoisson distributionPSCRComputational sciencefast Poisson solversymbols.namesakenopea Poisson-ratkaisijanäytönohjainsymbolsComputer Science::Mathematical SoftwareCyclic reductionGraphicsrinnakkaislaskentaCyclic reduction
researchProduct

IMEX schemes for pricing options under jump–diffusion models

2014

We propose families of IMEX time discretization schemes for the partial integro-differential equation derived for the pricing of options under a jump-diffusion process. The schemes include the families of IMEX-midpoint, IMEX-CNAB and IMEX-BDF2 schemes. Each family is defined by a convex combination parameter [email protected]?[0,1], which divides the zeroth-order term due to the jumps between the implicit and explicit parts in the time discretization. These IMEX schemes lead to tridiagonal systems, which can be solved extremely efficiently. The schemes are studied through Fourier stability analysis and numerical experiments. It is found that, under suitable assumptions and time step restric…

ta113Numerical AnalysisMathematical optimizationTridiagonal matrixDiscretizationApplied MathematicsJump diffusionStability (probability)Term (time)Computational MathematicsValuation of optionsConvex combinationLinear multistep methodMathematicsApplied Numerical Mathematics
researchProduct